Two cooperative versions of the Guessing Secrets problem

We investigate two cooperative variants (with and without lies) of the Guessing Secrets Problem, introduced in [4] in the attempt to model an interactive situation arising in the World Wide Web, in relation to the e¢ cient delivery of Internet content. After placing bounds on the cardinality of the smallest set of questions needed to win the game, we establish that the algebra of all the states of knowledge induced by any designated game is a pseudocomplemented lattice. In particular, its join semilattice reduct is embeddable into the corresponding reduct of the Boolean algebra 2 , where N is the cardinality of the search space.